
Layout test started..
added node in g2 p2[0] with id 0
added node in g2 p2[1] with id 1
added node in g2 p2[2] with id 2
added node in g2 p2[3] with id 3
added node in g2 p2[4] with id 4
added edge in g2 with id 2 between node 0 and node 1 with id 0
added edge in g2 between node 0 and node 2 with id 1
added edge in g2 between node 0 and node 3 with id 2
added edge in g2 between node 3 and node 4 with id 3
Reversed edges changed to 4
WeightedMedianHeuristic(): edge crossings reduced from 49 to 46
Transpose(): edge crossings reduced from 17 to 15 at try 1 rank 0
Transpose(): edge crossings reduced from 15 to 14 at try 1 rank 3
Transpose(): edge crossings reduced from 14 to 13 at try 1 rank 4
Transpose(): edge crossings reduced from 30 to 29 at try 1 rank 1
Transpose(): edge crossings reduced from 29 to 27 at try 1 rank 3
Transpose(): edge crossings reduced from 27 to 23 at try 1 rank 4
Transpose(): edge crossings reduced from 21 to 19 at try 1 rank 3
Transpose(): edge crossings reduced from 19 to 17 at try 1 rank 4
Transpose(): edge crossings reduced from 17 to 16 at try 1 rank 5
Transpose(): edge crossings reduced from 16 to 14 at try 1 rank 6
Transpose(): edge crossings reduced from 12 to 11 at try 1 rank 3
Transpose(): edge crossings reduced from 11 to 10 at try 1 rank 5
Transpose(): edge crossings reduced from 17 to 16 at try 1 rank 2
Transpose(): edge crossings reduced from 16 to 13 at try 1 rank 3
Transpose(): edge crossings reduced from 10 to 8 at try 1 rank 2
Transpose(): edge crossings reduced from 10 to 9 at try 1 rank 4
WeightedMedianHeuristic(): edge crossings reduced from 19 to 15
Transpose(): edge crossings reduced from 15 to 14 at try 1 rank 0
Transpose(): edge crossings reduced from 14 to 12 at try 1 rank 5
Transpose(): edge crossings reduced from 12 to 11 at try 2 rank 1
Ordering::Dump() there are 9 levels
Level rank 0 has these 1 nodes:
  id:0(45,0)
Level rank 1 has these 3 nodes:
  id:10(45,40) id:11(50,40) id:16(55,40)
Level rank 2 has these 3 nodes:
  id:1(35,80) id:12(40,80) id:3(55,80)
Level rank 3 has these 8 nodes:
  id:17(32,120) id:36(37,120) id:35(42,120) id:31(47,120) id:34(52,120) id:37(57,120) id:13(62,120) id:20(67,120)
Level rank 4 has these 7 nodes:
  id:5(20,160) id:6(35,160) id:32(40,160) id:7(55,160) id:38(60,160) id:14(65,160) id:21(70,160)
Level rank 5 has these 9 nodes:
  id:19(30,200) id:18(35,200) id:29(40,200) id:15(45,200) id:30(50,200) id:33(55,200) id:22(60,200) id:25(65,200) id:39(70,200)
Level rank 6 has these 5 nodes:
  id:2(25,240) id:8(40,240) id:23(45,240) id:26(50,240) id:9(65,240)
Level rank 7 has these 3 nodes:
  id:24(45,280) id:27(50,280) id:28(55,280)
Level rank 8 has these 1 nodes:
  id:4(45,320)
between level 2 and level 3 are 0 crossings
at rank 2 found 0 crossings and expected 0 crossings
between level 3 and level 4 are 0 crossings
at rank 3 found 0 crossings and expected 0 crossings
between level 4 and level 5 are 7 crossings, 0 local-nonlocal Type 1 conflict, 7 local-local Type 2 conflict, 0 nonlocal-nonlocal crossings type 0 conflict
at rank 4 found 0 crossings and expected 0 crossings
between level 5 and level 6 are 4 crossings, 2 local-nonlocal Type 1 conflict, 0 local-local Type 2 conflict, 2 nonlocal-nonlocal crossings type 0 conflict
between level 5 and level 6 are 2 Type 1 edge conflicts
edge crossing inner status 0 and 1
edge crossing inner status 0 and 1
at rank 5 found 2 crossings and expected 2 crossings
total 1 type 1 conflict edges in the graph
// conflict type 1 edge is noninner edge colored red and crossing between inner and noninner edge
// inner edge is blue
// noninner edge is green
digraph conflict1edges {
 0 -> 10 [color="blue"];
 10 -> 1 [color="green"];
 0 -> 11 [color="blue"];
 11 -> 12 [color="blue"];
 12 -> 13 [color="blue"];
 13 -> 14 [color="blue"];
 14 -> 15 [color="blue"];
 15 -> 2 [color="green"];
 0 -> 16 [color="blue"];
 16 -> 3 [color="green"];
 1 -> 17 [color="blue"];
 17 -> 5 [color="green"];
 6 -> 18 [color="blue"];
 18 -> 2 [color="green"];
 5 -> 19 [color="blue"];
 19 -> 2 [color="green"];
 3 -> 20 [color="blue"];
 20 -> 21 [color="blue"];
 21 -> 22 [color="blue"];
 22 -> 23 [color="blue"];
 23 -> 24 [color="blue"];
 24 -> 4 [color="green"];
 7 -> 25 [color="blue"];
 25 -> 26 [color="blue"];
 26 -> 27 [color="blue"];
 27 -> 4 [color="green"];
 9 -> 28 [color="blue"];
 28 -> 4 [color="green"];
 5 -> 29 [color="blue"];
 29 -> 8 [color="green"];
 6 -> 30 [color="blue"];
 30 -> 9 [color="red"];
 1 -> 31 [color="blue"];
 31 -> 32 [color="blue"];
 32 -> 33 [color="blue"];
 33 -> 8 [color="green"];
 1 -> 34 [color="blue"];
 34 -> 7 [color="green"];
 1 -> 35 [color="blue"];
 35 -> 6 [color="green"];
 1 -> 36 [color="blue"];
 36 -> 5 [color="green"];
 1 -> 37 [color="blue"];
 37 -> 38 [color="blue"];
 38 -> 39 [color="blue"];
 39 -> 9 [color="green"];
}
Graph has 1 starter nodes
Ordering::Dump() there are 9 levels
Level rank 0 has these 1 nodes:
  id:0(45,0)
Level rank 1 has these 3 nodes:
  id:10(45,40) id:11(50,40) id:16(55,40)
Level rank 2 has these 3 nodes:
  id:1(35,80) id:12(40,80) id:3(55,80)
Level rank 3 has these 8 nodes:
  id:17(32,120) id:36(37,120) id:35(42,120) id:31(47,120) id:34(52,120) id:37(57,120) id:13(62,120) id:20(67,120)
Level rank 4 has these 7 nodes:
  id:5(20,160) id:6(35,160) id:32(40,160) id:7(55,160) id:38(60,160) id:14(65,160) id:21(70,160)
Level rank 5 has these 9 nodes:
  id:19(30,200) id:18(35,200) id:29(40,200) id:15(45,200) id:30(50,200) id:33(55,200) id:22(60,200) id:25(65,200) id:39(70,200)
Level rank 6 has these 5 nodes:
  id:2(25,240) id:8(40,240) id:23(45,240) id:26(50,240) id:9(65,240)
Level rank 7 has these 3 nodes:
  id:24(45,280) id:27(50,280) id:28(55,280)
Level rank 8 has these 1 nodes:
  id:4(45,320)
Final Crossings: 11
after layout of graph 1 with dummy nodes and changed edges
Dumping graph id:0 (40 nodes, 10 real nodes, 30 dummy nodes, 46 edges, 0 horizontal edges, 0 selfedges 4 reversed edges)
Nodes:
Node id 0: (0 self-edges size (10,10) 0 in-edges 3 out-edges)
  3 Out edges: 0->10 0->11 0->16
Node id 1: (0 self-edges size (10,10) 1 in-edges 6 out-edges)
  1 In  edges: 10->1
  6 Out edges: 1->17 1->36 1->35 1->31 1->34 1->37
Node id 2: (0 self-edges size (10,10) 3 in-edges 0 out-edges)
  3 In  edges: 19->2 18->2 15->2
Node id 3: (0 self-edges size (10,10) 1 in-edges 1 out-edges)
  1 In  edges: 16->3
  1 Out edges: 3->20
Node id 4: (0 self-edges size (10,10) 3 in-edges 0 out-edges)
  3 In  edges: 24->4 27->4 28->4
Node id 5: (0 self-edges size (10,10) 2 in-edges 2 out-edges)
  2 In  edges: 17->5 36->5
  2 Out edges: 5->19 5->29
Node id 6: (0 self-edges size (10,10) 1 in-edges 2 out-edges)
  1 In  edges: 35->6
  2 Out edges: 6->18 6->30
Node id 7: (0 self-edges size (10,10) 1 in-edges 1 out-edges)
  1 In  edges: 34->7
  1 Out edges: 7->25
Node id 8: (0 self-edges size (10,10) 2 in-edges 0 out-edges)
  2 In  edges: 29->8 33->8
Node id 9: (0 self-edges size (10,10) 2 in-edges 1 out-edges)
  2 In  edges: 30->9 39->9
  1 Out edges: 9->28
Node id 10: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 0->10
  1 Out edges: 10->1
Node id 11: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 0->11
  1 Out edges: 11->12
Node id 12: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 11->12
  1 Out edges: 12->13
Node id 13: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 12->13
  1 Out edges: 13->14
Node id 14: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 13->14
  1 Out edges: 14->15
Node id 15: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 14->15
  1 Out edges: 15->2
Node id 16: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 0->16
  1 Out edges: 16->3
Node id 17: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 1->17
  1 Out edges: 17->5
Node id 18: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 6->18
  1 Out edges: 18->2
Node id 19: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 5->19
  1 Out edges: 19->2
Node id 20: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 3->20
  1 Out edges: 20->21
Node id 21: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 20->21
  1 Out edges: 21->22
Node id 22: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 21->22
  1 Out edges: 22->23
Node id 23: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 22->23
  1 Out edges: 23->24
Node id 24: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 23->24
  1 Out edges: 24->4
Node id 25: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 7->25
  1 Out edges: 25->26
Node id 26: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 25->26
  1 Out edges: 26->27
Node id 27: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 26->27
  1 Out edges: 27->4
Node id 28: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 9->28
  1 Out edges: 28->4
Node id 29: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 5->29
  1 Out edges: 29->8
Node id 30: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 6->30
  1 Out edges: 30->9
Node id 31: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 1->31
  1 Out edges: 31->32
Node id 32: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 31->32
  1 Out edges: 32->33
Node id 33: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 32->33
  1 Out edges: 33->8
Node id 34: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 1->34
  1 Out edges: 34->7
Node id 35: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 1->35
  1 Out edges: 35->6
Node id 36: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 1->36
  1 Out edges: 36->5
Node id 37: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 1->37
  1 Out edges: 37->38
Node id 38: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 37->38
  1 Out edges: 38->39
Node id 39: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 38->39
  1 Out edges: 39->9
Edges:
Edge id 16: 0->10 reversed=0 horizontal=0
Edge id 17: 10->1 reversed=0 horizontal=0
Edge id 18: 0->11 reversed=0 horizontal=0
Edge id 19: 11->12 reversed=0 horizontal=0
Edge id 20: 12->13 reversed=0 horizontal=0
Edge id 21: 13->14 reversed=0 horizontal=0
Edge id 22: 14->15 reversed=0 horizontal=0
Edge id 23: 15->2 reversed=0 horizontal=0
Edge id 24: 0->16 reversed=0 horizontal=0
Edge id 25: 16->3 reversed=0 horizontal=0
Edge id 26: 1->17 reversed=0 horizontal=0
Edge id 27: 17->5 reversed=0 horizontal=0
Edge id 28: 6->18 reversed=1 horizontal=0
Edge id 29: 18->2 reversed=1 horizontal=0
Edge id 30: 5->19 reversed=1 horizontal=0
Edge id 31: 19->2 reversed=1 horizontal=0
Edge id 32: 3->20 reversed=0 horizontal=0
Edge id 33: 20->21 reversed=0 horizontal=0
Edge id 34: 21->22 reversed=0 horizontal=0
Edge id 35: 22->23 reversed=0 horizontal=0
Edge id 36: 23->24 reversed=0 horizontal=0
Edge id 37: 24->4 reversed=0 horizontal=0
Edge id 38: 7->25 reversed=1 horizontal=0
Edge id 39: 25->26 reversed=1 horizontal=0
Edge id 40: 26->27 reversed=1 horizontal=0
Edge id 41: 27->4 reversed=1 horizontal=0
Edge id 42: 9->28 reversed=1 horizontal=0
Edge id 43: 28->4 reversed=1 horizontal=0
Edge id 44: 5->29 reversed=0 horizontal=0
Edge id 45: 29->8 reversed=0 horizontal=0
Edge id 46: 6->30 reversed=0 horizontal=0
Edge id 47: 30->9 reversed=0 horizontal=0
Edge id 48: 1->31 reversed=0 horizontal=0
Edge id 49: 31->32 reversed=0 horizontal=0
Edge id 50: 32->33 reversed=0 horizontal=0
Edge id 51: 33->8 reversed=0 horizontal=0
Edge id 52: 1->34 reversed=0 horizontal=0
Edge id 53: 34->7 reversed=0 horizontal=0
Edge id 54: 1->35 reversed=0 horizontal=0
Edge id 55: 35->6 reversed=0 horizontal=0
Edge id 56: 1->36 reversed=0 horizontal=0
Edge id 57: 36->5 reversed=0 horizontal=0
Edge id 58: 1->37 reversed=0 horizontal=0
Edge id 59: 37->38 reversed=0 horizontal=0
Edge id 60: 38->39 reversed=0 horizontal=0
Edge id 61: 39->9 reversed=0 horizontal=0
graph 1 maxrank = 8
Ordering::Dump() there are 5 levels
Level rank 0 has these 1 nodes:
  id:0(35,0)
Level rank 1 has these 3 nodes:
  id:7(35,40) id:6(40,40) id:5(45,40)
Level rank 2 has these 3 nodes:
  id:3(20,80) id:2(35,80) id:1(50,80)
Level rank 3 has these 1 nodes:
  id:8(40,120)
Level rank 4 has these 1 nodes:
  id:4(35,160)
}
after layout of graph 2 with dummy nodes and changed edges
Dumping graph id:2 (9 nodes, 5 real nodes, 4 dummy nodes, 8 edges, 0 horizontal edges, 0 selfedges 0 reversed edges)
Nodes:
Node id 0: (0 self-edges size (10,10) 0 in-edges 3 out-edges)
  3 Out edges: 0->7 0->6 0->5
Node id 1: (0 self-edges size (10,10) 1 in-edges 0 out-edges)
  1 In  edges: 5->1
Node id 2: (0 self-edges size (10,10) 1 in-edges 0 out-edges)
  1 In  edges: 6->2
Node id 3: (0 self-edges size (10,10) 1 in-edges 1 out-edges)
  1 In  edges: 7->3
  1 Out edges: 3->8
Node id 4: (0 self-edges size (10,10) 1 in-edges 0 out-edges)
  1 In  edges: 8->4
Node id 5: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 0->5
  1 Out edges: 5->1
Node id 6: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 0->6
  1 Out edges: 6->2
Node id 7: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 0->7
  1 Out edges: 7->3
Node id 8: (0 self-edges size (1,1) 1 in-edges 1 out-edges)
  1 In  edges: 3->8
  1 Out edges: 8->4
Edges:
Edge id 4: 0->5 reversed=0 horizontal=0
Edge id 5: 5->1 reversed=0 horizontal=0
Edge id 6: 0->6 reversed=0 horizontal=0
Edge id 7: 6->2 reversed=0 horizontal=0
Edge id 8: 0->7 reversed=0 horizontal=0
Edge id 9: 7->3 reversed=0 horizontal=0
Edge id 10: 3->8 reversed=0 horizontal=0
Edge id 11: 8->4 reversed=0 horizontal=0
graph 2 maxrank = 4
after layout of graph 3 with dummy nodes and changed edges
Dumping graph id:0 (0 nodes, 0 real nodes, 0 dummy nodes, 0 edges, 0 horizontal edges, 0 selfedges 0 reversed edges)
Nodes:
Edges:
